Undecidability of model-checking branching-time properties of stateless probabilistic pushdown process
نویسنده
چکیده
In this paper, we settle a problem in probabilistic verification of infinite–state process (specifically, probabilistic pushdown process). We show that model checking stateless probabilistic pushdown process (pBPA) against probabilistic computational tree logic (PCTL) is undecidable.
منابع مشابه
Branching-time model-checking of probabilistic pushdown automata
In this paper we study complexity of the model-checking problem for probabilistic pushdown automata (pPDA) and qualitative fragments of two branching-time logics PCTL∗ and PECTL∗. We prove that this problem is in 2-EXPTIME for pPDA and qualitative PCTL∗. Consequently, we prove that model-checking of stateless pPDA (pBPA) and both qualitative PCTL∗ and qualitative PECTL∗ is 2-EXPTIME-hard. These...
متن کاملThe complexity of model-checking of stateless probabilistic pushdown processes against PCTL
In this draft, we settle a problem in probabilistic verification of infinite–state processes (probabilistic pushdown systems). We show that model checking stateless probabilistic pushdown systems (pBPA) against probabilistic computational tree logic (PCTL) is undecidable.
متن کاملOn the Decidability of Temporal Properties of Probabilistic Pushdown Automata
We consider qualitative and quantitative model-checking problems for probabilistic pushdown automata (pPDA) and various temporal logics. We prove that the qualitative and quantitative model-checking problem for ω-regular properties and pPDA is in 2-EXPSPACE and 3-EXPTIME, respectively. We also prove that model-checking the qualitative fragment of the logic PECTL∗ for pPDA is in 2-EXPSPACE, and ...
متن کاملModel-checking branching-time properties of probabilistic automata and probabilistic one-counter automata
This paper studies the problem of model-checking of probabilistic automaton and probabilistic one-counter automata against probabilistic branching-time temporal logics (PCTL and PCTL∗). We show that it is undecidable for these problems. We first show, by reducing to emptiness problem of probabilistic automata, that the modelchecking of probabilistic finite automata against branching-time tempor...
متن کاملRegularity in Model Checking PDA Games
Concerning the model-checking problem of 1 1 2 -player games over transition graphs of pushdown automata (PDA) against the reachability objectives, we investigate the regularity of sets of configurations satisfying a given reachability objective. This is a natural question connected, e.g., to decidability of PCTL model checking. It was shown that these sets may not be regular even for probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014